Dynamic Scheduling of Intelligent Group Maintenance Planning under Usage Availability Constraint
نویسندگان
چکیده
Maintenance, particularly preventive maintenance, is a crucial measure to ensure the operational reliability, availability, and profitability of complex industrial systems such as nuclear asset, wind turbines, railway trains, etc. Powered by continuous advancement sensor technology, condition-based group maintenance has become available enhance execution efficiency accuracy plans. The majority existing plans are static, which require prescheduling sequences within fixed windows and, thus, cannot fully utilize real-time health information decision-making responsiveness. To address this problem, paper proposes an intelligent framework that capable dynamically iteratively updating all component information. A two-stage analytical model was formulated capture comprehensive impact scheduled opportunistic through failure analyses both degradation lifetime components. penalty functions for advancing or postponing were calculated based on state age each in arbitrary groups, subsequent grouping time sequence components be repaired updated. cost optimized under usage availability constraint sequential dynamic programming sequences. Numerical experiments demonstrated superior performance proposed approach control insurance compared with conventional static periodic approaches.
منابع مشابه
Study of Scheduling Problems with Machine Availability Constraint
In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...
متن کاملGrouping maintenance strategy with availability constraint under limited repairmen
The paper deals with a development of the rolling horizon approach introduced recently for grouping maintenance strategies of multi-component systems by integrating two efficient optimization algorithms. The proposed approach can help to construct an optimal maintenance planning with a given availability constraint under limited repairmen. Thanks to the rolling horizon spirit, the maintenance p...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملDynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and scheduling problems are solved independently using different methods. Recent development of Constraint Programming brings a new breeze to these areas. It allows using the same techniques for modelling planning and schedu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10152730